The interval count of interval graphs and orders: a short survey
نویسندگان
چکیده
منابع مشابه
New Perspectives on Interval Orders and Interval Graphs
Interval orders and interval graphs are particularly natural examples of two widely studied classes of discrete structures: partially ordered sets and undirected graphs. So it is not surprising that researchers in such diverse fields as mathematics, computer science, engineering and the social sciences have investigated structural, algorithmic, enumerative, combinatorial, extremal and even expe...
متن کاملThe niche graphs of interval orders
The niche graph of a digraph D is the (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if N D (x)∩N + D (y) 6= ∅ or N − D (x)∩ N D (y) 6= ∅, where N + D (x) (resp. N − D (x)) is the set of out-neighbors (resp. in-neighbors) of x in D. A digraph D = (V,A) is called a semiorder (or a unit interval order) if there exist ...
متن کاملMinimization of Open Orders Using Interval Graphs
In this paper we address an order processing optimization problem known as the Minimization of Open Stacks Problem (MOSP). This problem consists in finding the best sequence for manufacturing the different products required by costumers, in a setting where only one product can be made at a time. The objective is to minimize the maximum number of incomplete orders from costumers that are being p...
متن کاملInterval orders and dimension
We show that for every interval order X , there exists an integer t so that if Y is any interval order with dimension at least t, then Y contains a subposet isomorphic to X .
متن کاملOn the non-unit count of interval graphs
We introduce the non-unit count of an interval graph as the minimum number of intervals in an interval representation whose lengths deviate from one. We characterize a variant of the non-unit count (where all interval lengths are required to be at least one) and graphs with non-unit count 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2011
ISSN: 0104-6500,1678-4804
DOI: 10.1007/s13173-011-0047-1